Optimal computation of 3-D similarity: Gauss-Newton vs. Gauss-Helmert
نویسندگان
چکیده
Because 3-D data are acquired using 3-D sensing such as stereo vision and laser range finders, they have inhomogeneous and anisotropic noise. This paper studies optimal computation of the similarity (rotation, translation, and scale change) of such 3-D data. We first point out that the Gauss-Newton and the Gauss-Helmert methods, regarded as different techniques, have similar structures. We then combine them to define what we call the modified Gauss-Helmert method and do stereo vision simulation to show that it is superior to either of the two in convergence performance. Finally, we show an application to real GPS geodetic data and point out that the widely used homogeneous and isotropic noise model is insufficient and that GPS geodetic data are prone to numerical problems.
منابع مشابه
Computing Helmert transformations
The Helmert transformation is used in geodesy. It transforms a set of points into another by rotation, scaling and translation. When both sets of points are given, then least squares can be used to solve the inverse problem of determining the parameters. In particular, the parameters of the so-called 7 parameter transformation can be obtained by standard methods. In this note, it is shown how a...
متن کاملA Gauss-Newton Approach for Nonlinear Optimal Control Problem with Model-Reality Differences
Output measurement for nonlinear optimal control problems is an interesting issue. Because the structure of the real plant is complex, the output channel could give a significant response corresponding to the real plant. In this paper, a least squares scheme, which is based on the Gauss-Newton algorithm, is proposed. The aim is to approximate the output that is measured from the real plant. In ...
متن کاملFast Curvature Matrix-Vector Products for Second-Order Gradient Descent
We propose a generic method for iteratively approximating various second-order gradient steps - Newton, Gauss-Newton, Levenberg-Marquardt, and natural gradient - in linear time per iteration, using special curvature matrix-vector products that can be computed in O(n). Two recent acceleration techniques for on-line learning, matrix momentum and stochastic meta-descent (SMD), implement this appro...
متن کاملar X iv : 0 70 9 . 14 24 v 1 [ qu an t - ph ] 1 0 Se p 20 07 Gauss sum factorization with cold atoms
The Shor algorithm [1] to factor numbers and its NMRimplementation [2] have propelled the field of quantum computation [3]. Recently a different factorization scheme [4] taking advantage of the periodicity properties of Gauss sums [5] has been proposed [6] and verified by two NMR-experiments [7, 8] and one experiment based on short laser pulses [9]. In the present paper we report the first impl...
متن کاملA new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 56 شماره
صفحات -
تاریخ انتشار 2012